New Formulation for Coloring Circle Graphs And its Application to Capacitated Stowage Stack Minimization

A circle graph is a in which the adjacency of vertices can be represented as intersection chords circle. The problem calculating chromatic number known to NP-complete, even on graphs. In this paper, we propose new integer linear programming formulation for coloring We also show that relaxation our finds fractional given graph. As byproduct, gives polynomial-sized extend result capacitated stowage stack minimization problem.